On Travelling Future Trails
نویسندگان
چکیده
منابع مشابه
On Auditing Audit Trails
T he current auditing crisis of big business can provide useful lessons and suggestions for improving similar practices within the computer industry. Audit trails, whether computerbased or manually produced, typically form a significant part of the front-line defense for fraud detection and prevention within systems. Many of our security practices revolve around the generation and preservation ...
متن کاملOn paths, trails and closed trails in edge-colored graphs
In this paper we deal from an algorithmic perspective with different questions regarding properly edge-colored (or PEC) paths, trails and closed trails. Given a c-edge-colored graph G, we show how to polynomially determine, if any, a PEC closed trail subgraph whose number of visits at each vertex is specified before hand. As a consequence, we solve a number of interesting related problems. For ...
متن کاملOn Linear Hulls and Trails
Abstract. This paper improves the understanding of linear cryptanalysis by highlighting some previously overlooked aspects. It shows that linear hulls are sometimes formed already in a single round, and that overlooking such hulls may lead to a wrong estimation of the linear correlation, and thus of the data complexity. It shows how correlation matrices can be used to avoid this, and provides a...
متن کاملOn Linear Hulls and Trails in Simon
The block cipher Simon has a very simple round function. This simplicity allows us to compute the correlation matrix of the round function. Despite its simplicity, Simon exhibits some very interesting phenomena with respect to linear cryptanalysis. The combination of an expanding linear function and a compressing nonlinear function creates one-round hulls. These hulls complicate the estimation ...
متن کاملScheduling light-trails on WDM rings
We consider the problem of scheduling communication on optical WDM (wavelength division multiplexing) networks using the light-trails technology. We give two online algorithms which we prove to have competitive ratios O(log n) and O(log n) respectively. We also consider a simplification of the problem in which the communication pattern is fixed and known before hand, for which we give a solutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Counterfutures
سال: 2017
ISSN: 2463-5340,2463-5340
DOI: 10.26686/cf.v3i0.6415